Non-intersecting leaf insertion algorithm for tree structure models

نویسندگان

  • Markku Åkerblom
  • Pasi Raumonen
  • Eric Casella
  • Mathias I Disney
  • F Mark Danson
  • Rachel Gaulton
  • Lucy A Schofield
  • Mikko Kaasalainen
چکیده

We present an algorithm and an implementation to insert broadleaves or needleleaves into a quantitative structure model according to an arbitrary distribution, and a data structure to store the required information efficiently. A structure model contains the geometry and branching structure of a tree. The purpose of this work is to offer a tool for making more realistic simulations of tree models with leaves, particularly for tree models developed from terrestrial laser scanning (TLS) measurements. We demonstrate leaf insertion using cylinder-based structure models, but the associated software implementation is written in a way that enables the easy use of other types of structure models. Distributions controlling leaf location, size and angles as well as the shape of individual leaves are user definable, allowing any type of distribution. The leaf generation process consist of two stages, the first of which generates individual leaf geometry following the input distributions, while in the other stage intersections are prevented by carrying out transformations when required. Initial testing was carried out on English oak trees to demonstrate the approach and to assess the required computational resources. Depending on the size and complexity of the tree, leaf generation takes between 6 and 18 min. Various leaf area density distributions were defined, and the resulting leaf covers were compared with manual leaf harvesting measurements. The results are not conclusive, but they show great potential for the method. In the future, if our method is demonstrated to work well for TLS data from multiple tree types, the approach is likely to be very useful for three-dimensional structure and radiative transfer simulation applications, including remote sensing, ecology and forestry, among others.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

S-cd: Surface Collision Detection Toolkit for Virtual Prototyping

This paper presents an efficient collision detection algorithm designed to support assembly and maintenance simulation of complex assemblies. This approach exploits the surface knowledge, available from CAD models, to determine intersecting surfaces. It proposes a novel combination of Overlapping Axis-Aligned Bounding Box (OAABB) and R-tree structures to gain considerable performance improvemen...

متن کامل

Surface Collision Detection for Virtual Prototyping

This paper presents an efficient collision detection algorithm designed to support assembly and maintenance simulation of complex assemblies. This approach exploits the surface knowledge, available from CAD models, to determine intersecting surfaces. It proposes a novel combination of Overlapping Axis-Aligned Bounding Box (OAABB) and R-tree structures to gain considerable performance improvemen...

متن کامل

Research on Spatial Index of Electric Gis

In the electric GIS, facilities in different voltage levels show a different proportion, and topological relations exist in line and point. According to the limitations in multi-scale representation and topological connection of traditional spatial index, an extended R-Tree model based on multi-scale clustering(MCER Tree) is proposed, which removed the restrictions of the same height of all lea...

متن کامل

Dynamic Tree Shortcut with Constant Degree

Given a rooted tree with n nodes, the tree shortcut problem is to add a set of shortcut edges to the tree such that the shortest path from each node to any of its ancestors is of length O(logn) and the degree increment of each node is constant. We consider in this paper the dynamic version of the problem, which supports node insertion and deletion. For insertion, a node can be inserted as a lea...

متن کامل

An Efficient Algorithm for Determining an Aesthetic Shape Connecting Unorganised 2D Points

We present an efficient algorithm for determining an aesthetically pleasing shape boundary connecting all the points in a given unorganised set of 2D points, with no other information than point coordinates. By posing shape construction as a minimisation problem which follows the Gestalt laws, our desired shape Bmin is non-intersecting, interpolates all points and minimises a criterion related ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره 8  شماره 

صفحات  -

تاریخ انتشار 2018